home *** CD-ROM | disk | FTP | other *** search
- Path: in1.uu.net!zdc!zippo!drn
- From: Clarence Chiang
- Newsgroups: comp.lang.c++
- Subject: Re: Can I do it recursively?
- Date: 3 Apr 1996 12:48:22 -0800
- Organization: Zippo
- Sender: http@doc.zippo.com
- Message-ID: <4juo6m$n6i@doc.zippo.com>
- NNTP-Posting-Host: doorstop.spiderisland.com
-
- In article <4jrcqj$3s1@nuscc.nus.sg>, eng50636@leonis.nus.sg says...
- >
- >Hi,
- >
- > I am doing a program of a famous problem(forget the name, sorry). It is
- >
- >about how a horse can travel through the whole 8x8 chess board,without
- >
- >repeating any position that has been travelled(may seem to easy for
- >
- >experts---I am only a beginner). I want to do it by recursion. But it
- >
- >seems quite impossible since the run-time is too long.
- >
- > I just want to know whether there is a good method that can give me the
- >
- >answer by means of some checking to reduce the possibilities. Is it
- >
- >possible? (Again, need to be done recursively.)
- >
- > Any help is appreciated!!!
- >
- >
-
- I don't think it is a question of whether the problem can be solved recursively
- or iteratively. It is just that this problem is one of those NP-complete problem,
- which requires exponential amount of time as the problem size grows.
-
- Clarence Chiang
- Spider Island Software
-
-